Analysis of Quality of Service Routing Algorithms

The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Multicast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing problem is as follows. Given a source node sr, a set st of destination nodes, a set of constraints cts and an optimization goal (optional), find the best feasible path covering sr and all nodes in st, which satisfies cts. This article presents two such Unicast QoS based algorithms called as Source Routing and the proposed Heuristic Routing. A Client Server based model has been generated to study the performance of the two algorithms with respect to the message overhead, response time and path delay. The Experiments and the results are analyzed. INTRODUCTION AND RELATED WORK The Internet Community today needs multimedia communication than the traditional, well known Internet Protocol (IP) infrastructure. IP has proven to be very effective since no privileged service classes are considered, but it is not adequate for the introduction of “Quality of Service” (QoS). QoS communications on the internet are high speed connections and the goal of QoS routing is to find routes that satisfy the requirements of individual flows and to provide quality multimedia communications. Analysis of Quality of Service Routing Algorithms 160 In Computer communication networks, data packets are forwarded between different nodes. Multiple paths may exist from the start node to the destination node. Due to the different qualities of links and traffic load variations, different paths may have different performance related Quality of Service properties, such as delay, response time, overhead, etc. Finding a path that satisfies some given QoS constraints is the base of QoS routing (Chen & Nahrstedt, 1998; Zhang, Sanchez, Salkewicz, & Crawley, 1996). The routing problems can be divided into two major classes. They are 1. unicast routing and 2. multicast routing. The unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc (Zheng, Tian, Liu, & Dou, 2004. (Koundinya, Negi, & Sastry, 2004). The multicast routing problem is as follows (Yuan & Liu, 2001; Moen, & Pullen, 2007; Moen, & Pullen, 2005; Moen, Pullen, & Zhao, 2004; Simon, & Pullen, 2003; Moen & Pullen, 2003). Given a source node sr, a set st of destination nodes, a set of constraints cts and an optimization goal (optional), find the best feasible path covering sr and all nodes in st, which satisfies cts. This article presents two such unicast QoS based algorithms called as Source Routing and the proposed Heuristic Routing. A Client Server based model has been generated to study the performance of the two algorithms with respect to the message overhead, response time and path delay. The Experiments and the results are analyzed.